Improved Approximation Algorithms for Box Contact Representations
نویسندگان
چکیده
منابع مشابه
Improved Approximation Algorithms for Connected Sensor Cover
Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active pro...
متن کاملImproved deterministic approximation algorithms for Max TSP
We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...
متن کاملImproved approximation algorithms for Directed Steiner Forest
We consider the k-Directed Steiner Forest (k-DSF) problem: Given a directed graph G = (V,E) with edge costs, a collection D ⊆ V × V of ordered node pairs, and an integer k ≤ |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs (s, t) ∈ D. When k = |D|, we get the Directed Steiner Forest (DSF) problem. The best known approximation ratios for these problems are...
متن کاملImproved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 78−o(1). Both algorithms improve on the previous bests.
متن کاملImproved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipartite graph, the objective of BCC is to generate a set of vertex-disjoint bi-cliques (clusters) which minimizes the symmetric difference to it. The best known approximation algorithm for BCC due to Amit (2004) guarantee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0121-3